Geometric Bounds for Stationary Distributions of In nite Markov Chains Via Lyapunov Functions

نویسندگان

  • Dimitris Bertsimas
  • David Gamarnik
  • John N. Tsitsiklis
چکیده

In this paper, we develop a systematic method for deriving bounds on the stationary distribution of stable Markov chains with a countably innnite state space. We assume that a Lyapunov function is available that satisses a negative drift property (and, in particular, is a witness of stability), and that the jumps of the Lyapunov function corresponding to state transitions have uniformly bounded magnitude. We show how to derive closed form, exponential type, upper bounds on the steady-state distribution. Similarly, we show how to use suitably deened lower Lyapunov functions to derive closed form lower bounds on the steady-state distribution. We apply our results to homogeneous random walks on the positive orthant, and to multiclass single station Markovian queueing systems. In the latter case, we establish closed form exponential type bounds on the tail probabilities of the queue lengths, under an arbitrary work conserving policy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence of ODE approximations and bounds on performance models in the steady-state

We present a limiting convergence result for differential equation approximations of continuous-time Markovian performance models in the stationary (steady-state) regime. This extends existing results for convergence up to some finite time. We show how, for a large class of performance models, this result can be inexpensively exploited to make strong statements about the stationary behaviour of...

متن کامل

Perturbation theory for Markov chains via Wasserstein distance

Perturbation theory for Markov chains addresses the question of how small differences in the transition probabilities of Markov chains are reflected in differences between their distributions. We prove powerful and flexible bounds on the distance of the nth step distributions of two Markov chains when one of them satisfies a Wasserstein ergodicity condition. Our work is motivated by the recent ...

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

Entropy and Mutual Information for Markov Channels with General Inputs

We study new formulas based on Lyapunov exponents for entropy, mutual information, and capacity of finite state discrete time Markov channels. We also develop a method for directly computing mutual information and entropy using continuous state space Markov chains. Our methods allow for arbitrary input processes and channel dynamics, provided both have finite memory. We show that the entropy ra...

متن کامل

On Entropy and Lyapunov Exponents for Finite-State Channels

The Finite-State Markov Channel (FSMC) is a time-varying channel having states that are characterized by a finite-state Markov chain. These channels have infinite memory, which complicates their capacity analysis. We develop a new method to characterize the capacity of these channels based on Lyapunov exponents. Specifically, we show that the input, output, and conditional entropies for this ch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998